The intersection problem for kite-GDDs
نویسندگان
چکیده
In this paper the intersection problem for a pair of kite-GDDs type 4u is investigated. The determination all pairs (T, s) such that there exists (X,H,B1) and (X,H,B2) same T |B1?B2| = s. Let J(u) {s : ? intersecting in s blocks}; I(u) {0, 1,..., bu 2, bu}, where 2u(u 1) number blocks kite-GDD 4u. We show any positive integer u 3, I(u).
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe intersection problem for cubes
For all integers m, nand t, we determine necessary and sufficient conditions for the existence of (1) a pair of 3-cube decompositions of Kn having precisely t common 3-cubes; and (2) a pair of 3-cube decompositions of Km,n having precisely t common 3-cubes.
متن کاملThe unimodular intersection problem
We show that finding minimally intersecting n paths from s to t in a directed graph or n perfect matchings in a bipartite graph can be done in polynomial time. This holds more generally for unimodular set systems.
متن کاملThe μ-way intersection problem for cubes
A collection of Il 3-cube decompositions of a graph G is said to have intersection size t if there is a set S, with 181 = t, of 3-cubes which is contained in every decomposition, and no 3-cube which is not in S occurs in more than one decomposition. We determine all integers n, t and Il, with Il ::; 12, for which there exists a collection of Il 3-cube decompositions of Kn with intersection size...
متن کاملThe Intersection Problem for Finite Monoids
We investigate the intersection problem for finite monoids, which asks for a given set of regular languages, represented by recognizing morphisms to finite monoids from a variety V, whether there exists a word contained in their intersection. Our main result is that the problem is PSPACE-complete if V 6⊆ DS and NP-complete if 1 ( V ⊆ DO. Our NP-algorithm for the case V ⊆ DO uses novel methods, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2023
ISSN: ['2406-0933', '0354-5180']
DOI: https://doi.org/10.2298/fil2307227z